A Constraint Database System for Temporal Knowledge

نویسندگان

  • Roman Gross
  • Robert Marti
چکیده

This paper describes how the technology of deductive constraint database systems and constraint query languages can be used to represent and reason with tem poral knowledge First we summarize our approach to manipulating constraints over reals within deductive database sys tems This approach is based on the compile time rewriting of clauses which are not admissible Then we show how the timestamping of facts and rules in temporal databases can be mapped to constraints over reals Subsequently we present a more e cient and elegant ap proach which is based on a special tem poral constraint solver

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Querying Inde nite Temporal and Spatial Information: A New Frontier

Temporal and spatial constraint networks do not live alone in the wilderness. In many cases they are components of larger systems e.g., temporal database systems , spatial database systems, knowledge representation systems, natural language systems, planning systems , scheduling systems, multimedia systems and so on. We believe that an interesting new frontier for temporal and spatial reasoning...

متن کامل

Multi-dimensional knowledge representation with a fuzzy extension

This paper presents some prefiminary results of our current attempts to develop a hybrid multi-dimensional knowledge representation scheme which can handle both the incompleteness and uncertainty. We have started from the quantitative temporal constraint information, and extended it with possibilistic quantifiers. We have also extended the former towards a multidimensional constraint-based form...

متن کامل

A Temporal-Probabilistic Database Model for Information Extraction

Temporal annotations of facts are a key component both for building a high-accuracy knowledge base and for answering queries over the resulting temporal knowledge base with high precision and recall. In this paper, we present a temporalprobabilistic database model for cleaning uncertain temporal facts obtained from information extraction methods. Specifically, we consider a combination of tempo...

متن کامل

A New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)

Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...

متن کامل

Querying Temporal Constraint Networks in PTIMEManolis

We start with the assumption that temporal knowledge usually captured by constraint networks can be represented and queried more effectively by using the scheme of indeenite constraint databases proposed by Koubarakis. Although query evaluation in this scheme is in general a hard computational problem, we demonstrate that there are several interesting cases where query evaluation can be done in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007